Cosmic Ray Report

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d4a35930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d45b4550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d47e0b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d49f9810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d47fecb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d47e2f20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d475dcf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d4a08af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d475d510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d4a08280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d4b5f0d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d45b5240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d47e0790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d474c1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d47e2fe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d475c4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d4b5f100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d4a09cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d48ac880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d4661ae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d4a352a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d4750bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d475c490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f65d48af190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d35ff370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3193f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3722e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d35c0a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d33abc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3225810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d34457b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d35de920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d34452d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d35de710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d35fc040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d35c3130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d32277f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3444160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3225c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3444ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d32271f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3444a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3723010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3236d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d336f7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3430ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3410700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04d3354ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.94s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28afb6dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b2d7130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28aeb9a50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28ad447c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28ade9120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b18c940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b176ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28addb4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b176650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28add8c70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b1840d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28ad44f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b09b8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b175390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b099a80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b1757e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28aed0370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b175e70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28aebaa40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28b1766e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28af5cbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28af38820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28af6a2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff28ad458a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.96s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb172dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbaf00ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb492da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb220880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbaf00b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb3582e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbaf03e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb332320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbaf006d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb333a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb492aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb108790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb23ed10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb171750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbafa5d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbaf011b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb18ef80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbaf01480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb18f640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbaf00850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb0dcfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb35b790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbafa5b70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdfbb08ada0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.94s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce712e5f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6cb0250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e5f310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce70f0880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6f1ad70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e5ed40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e78b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce7102080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e784c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce71011b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce7256da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6cb1210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e5c3a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6f49d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e5d9c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e7b460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce7256260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce7103a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e3fee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6d59a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce712d930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e4a230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e7a620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2ce6e3fb80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.70s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944561a6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944593b0d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944551d7e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94453a8280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944544e140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944570fbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94455269b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944543d870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9445527eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944543f520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94457f1930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944570de70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944565e9e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94457d9c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944565d450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9445525240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94453a9120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9445526e90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944570cee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9445598c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94457e9f60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f944593b0a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f94455cd4b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9445618e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.68s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" - str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f0ce18a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f0919960>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f0874250>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f1a6d3f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f0874e50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f09f0640>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f0ccd4b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f0ca5720>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f0ce14b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f0b2c1f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f0cce950>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc5f091a380>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.46s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8b43d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8c96b60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d88909d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d86f08b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8c96890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8a08970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8c96b90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8a08d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8c961d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8a09a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8c43e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8b4d0f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8b6f2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d89c9ea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d89f42b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8a74e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8799e10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d86f1ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d88baa10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d889e440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d88e84c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8b43ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d88d78b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f67d8b6c820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c15d1810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c1360760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c14f0250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c18f2980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c14078b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c13f7970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c1619ed0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c16b26b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c161a6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c16b0b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c13f5db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c15d1960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c14f0c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c1619450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c14f0160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c1793e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c17bb250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c15875b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c1546c20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c15fe2c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c1363c70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c17a0f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c14f1210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f55c1547d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8dfbdf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8f4eb00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8df90c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d89a8040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8f4ee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8c54ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8f4f070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8cc88b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8c635e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8ccae90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8dfad70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8e26aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8a462f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8f4e5c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8e103d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8c3ba90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8a474f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8c39690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8c70a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8c3b010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8b7e920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8b48be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8e10f70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f91d8df9db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da856ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da97aec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da570190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da3e8e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da48d8a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da836500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da819f30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da47f970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da818b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da47f460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da682ef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da834ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da7421a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da3e8670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da741600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da47d090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da573ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da836710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da6f5930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da8351b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da854460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da578790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da82b850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fa9da6811e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7dd49d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7d8dc6d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7da79600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7de6ec20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7d980fa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7d972c80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7dba1e70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7db976d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7dba1870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7db943a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7d971210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7dd1c9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7dd35480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7dba1450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7da78940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7dba1a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7db982e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7d972290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7d8ddf00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7dd494b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7d982ad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7db9a8c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7dbfcca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fee7db95330>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2ba7df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2cf6a70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c28ee650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2764790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2cf69b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c29dc970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2cf6bc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c29dcd60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2cf6d40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c29ddd20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2ca0370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2bbdae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c29d50f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2a2d090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c29d73a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c29f00a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2809c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2cf6170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c27f97b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c28dbfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2b964a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c294b5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2a2d990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fc4c2cf6bc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" * str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb3235a80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb3068310>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb2fc7eb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb306ac50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb2fc4a90>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb313d720>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb2fc47f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb306aef0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb33f5840>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb32bdc60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb32467a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7fdbb32be470>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.47s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f44e290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f1dc310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f364be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f60d6c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f45ac50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f366ec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f36cbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f61c700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f36dfc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f61c910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f76e1a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f1dca30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f3644c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f465150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f365240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f36f430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f76ef50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f61ee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f321090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f281cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f44f220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f4a50f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f36cb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c9f323b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ebc6050>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e758b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e973610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423eceb070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ea3a7a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e7fc520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e758130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ea22a40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ecea380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ea23eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e9d77f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e9d1d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ea233a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e972410>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ea23df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e758670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ea20550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ea3a260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423eb8b340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ebb16c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e7ff670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e8e4640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423ea236d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f423e9d1600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb51ded40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4d60700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4f0d030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb53066e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4e0b8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4df9690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb51a19c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4ff9c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb51a1450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4ffa800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb51de830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb50ad6f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb51bb4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb5306dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4e09db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb51a2980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4e0b8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4df9990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb50acdf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb51b2dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb5028d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4f0d3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb50af460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbeb4f18b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.66s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc512e200>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc544f010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc504d930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc4ebc970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc4f62080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc514baf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc50a4880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc4f51de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc50a7e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc4f523e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc5315cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc514b280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc5136b30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc52ee6b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc5134100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc50a4430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc4ebf4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc50a4ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc51488b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc50a5c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc52fc340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc5035090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc4f61690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdc52ff460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c877b280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c88cac80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c8779060>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c83382b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c88ca980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c87a6a70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c88cab00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c8605690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c85cf580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c8607fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c83de0e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c85f1c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c8606020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c88cabf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c83ce2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c85ce2c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c83cd2d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c83df340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c8768310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c877b730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c854f1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c8338700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c85f3970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f57c83cf0d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab9ac490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dabb02b60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab9ac9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab55c6a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab9ae110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab890a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab9ac6d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab6f61d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab7ff5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab6f6530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab9d8bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab890c10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab7eab00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab9ae440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab5f6a70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab7fcc10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab99cbe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab6077f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab757d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab722260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab755a80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab99f7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab77b9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6dab6f6050>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.68s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" / str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdee96950>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdefe6fb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdee945e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdea548b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdebe6cb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcded0e860>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdee8f7c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdeafad70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdee8f6d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdeaf8f10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdeae9360>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fbcdec10130>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.46s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e56ec20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e2fc700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e48c220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e88f010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e3a3820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e392ec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e5bb0a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e57c910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e5b93c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e57d6c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e3910f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e56d210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e48c4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e5b9f00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e48cc10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e72cf70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e758220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e72c9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e3a2bf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e392590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e486d70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e2fdf60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e5b92d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f901e56cd00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2cb73dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c704160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2cc96ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c98ca30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c704460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2cb5c850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c704c10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2cb34ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c704f70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2cb37940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c98e500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c7ab280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2ca4d030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2cb70b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2cb45690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c704a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2ca4ee60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2ca45960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c8c2380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c8a05e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c79b0d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c94bee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c8c1150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0c2c7abfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed86039d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85bbc7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85d843a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed86162950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85c650c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85c57730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85d54d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85f221a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85d568c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85f20850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85c56dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed8600c2e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed860254e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85d554e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85d86cb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85d56140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85ec0910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85c55e70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85bbfb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed8603b2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85c65ea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85ec28f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85f229e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed85d582e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.70s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b95beb30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b96e2bc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b92f2650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b9419480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b92f1db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b9589870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b92f1c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b95ab910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b92f2a10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b95a8b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b9455b10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b941b0a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b958be80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b91f7700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b91e68f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b92f04c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b958b280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b9419900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b93d7910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b9419630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b932eaa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b9418d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b934f4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb0b9456020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f52766f8af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f527684aa40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f52764307f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f52762b88b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f527684a320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5276560940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f527684aad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f52765617b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f527684b040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5276561c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5276667670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f52767010f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f527652aec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f52765b0f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f527657f880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5276572c50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f52766eb430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5276570730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f52766ea9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f527635e380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f52766f8340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5276433eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f527634ecb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5276529e10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.62s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca7022f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca82ab90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca44c160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca284d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca32d810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca6ec8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca6c5180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca31e950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca6c45b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca31f6d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca603040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca6edea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca51f010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca284a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca51c5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca31d900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca44f940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca6ecd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca41ee30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca6ed870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca829a50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca5490c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca6d7820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f92ca702200>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" // str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd1f39600>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd21f6140>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd24363b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd22e4340>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd2436b60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd22dabc0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd24366e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd22e60b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd21f4970>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd20484c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd1ea7790>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fecd21da800>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.48s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30214f9ed0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3021288bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f302181a2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30216bbf10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30215681c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30216e1240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f302131de40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30215516c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f302131fa90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3021551390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f302128a770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f302181a890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30216e1420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f302131e2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30216e1f30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30216cb7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30216e31f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30216ca980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30214ff010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f302131df90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f302150fb80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f302146c220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f30216b9600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f3021818e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f6f84f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f47a9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f6fb0d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f56f430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f6fa8f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f56e380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f6fb4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f706710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f6f80a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f34ccd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f707c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f702f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f34e980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f714f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f34cfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f6df220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f34df00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f6deec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f4792a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f715270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f359e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f478970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f4983a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f161f481a80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5608621d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5603f4070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc56057f4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5609863b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5603f4e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc56049b8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5603f5000>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5605dce20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5603f5150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5605dfd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc56057dd50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc560759d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc560499c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5606aed10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc560584e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5606ac5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc560587160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5609864d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5605df490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc56075b8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5605db160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc560758130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5606ae290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fc5605dca00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.61s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5312e6200>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe531077f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe531606860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5314a4eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5313326e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5314bcfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe53110a9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5313cd630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe53110bf70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5313ce860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe531076770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5316068c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5314bc3a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe53110ada0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5314bf7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5314b68c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5314bf610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5314b6ad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5313b6ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe531108af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5313c8d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5311741f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe5314a7280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fe531606c20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b725261a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b720a82e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b72257520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b7264eec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b720abeb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b72150250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b720a8520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b72370fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b720a90c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b72373eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b722568f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b7234b160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b721503a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b722418d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b722732e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b72240430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b722732b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b7264ebc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b72371180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b723493c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b7224e320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b72254be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b7264e950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4b7224ee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992616ec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992198c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f599273e710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f59925dbee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992360220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992601870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992232ad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992330b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992231db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992331db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f599219a7d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f599273ed40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992601840>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f59922337f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992603eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f59925e98d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f59926038e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f59926146d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f599244e110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992199180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f599250fbe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f59924b28f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f59925d9690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f5992330130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.66s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" % str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f052a1a97b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529de3070>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529d3ceb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529de2bc0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529d3c700>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529ec56f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529d3c910>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529de1330>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f052a16ec20>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529fbdea0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529de2050>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7f0529fbddb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.45s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77934d70d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7793626bf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f779320c820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7793097f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77933eff70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7793398820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77933efc10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77934c6800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77933ee980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77934c5870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7793139690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77934f08b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f779321fd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7793502f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77934d5cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77933efa00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f779313b9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f77933ec5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7793129f60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f779335eb90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7793094dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f779312a980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f779324f220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7793626830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23efa9f00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23eb3c760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ecdd6c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23f0ce7a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ebe3760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ebd2aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ee0a230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ee978b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ee0a050>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ee942e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ebd1a80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23efab850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ecde2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ee09f60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ecdd9f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ef6f970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ef97130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ee04040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ed1a830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23edd2530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23eb3e860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ef7c070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ecdf7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd23ed19e70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.72s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65d29f30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a658ac4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65e53100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65cefd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65a51960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65d15300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65944370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65bb2c20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a659463b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65bb1480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a658ae920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65e52b60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65d16260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65946f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65d15120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65cfde40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65d14490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65cff250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65b4e980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65955060>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65c11930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65a67fa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65acb700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a65cec5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26fc5a2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f7dcf40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26fd82590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26fc1fee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f7dc340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f982e60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26fc1cbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26faa4580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26fc1cfd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26faa68c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26fc2f250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f980be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f7dd240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26fc1df90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f7dd7b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f981660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26fb12110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f980430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f9c3640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f9802e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f887370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f9c0a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26f9a8190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb26faa7940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.66s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bd4ee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11b8e0d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11be72fb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bd0d180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11ba7da50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11b974f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bd19390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bb9e680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11be72e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bb9f4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bd0fc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bbc0280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11b987970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bd21c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11b985f30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bd19990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bbc1330>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11b8e2470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bb01e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bd0da50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11bd4f040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11ba7d510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11be72d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe11b975690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.69s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba4767070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba488ec20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba44926b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba42e8f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba4395810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba47509d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba4729db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba4386710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba472a290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba4387580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba4664820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba4752560>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba45b8220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba42e9120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba45b8df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba4385b70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba488e7d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba45bae90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba488ef80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba45b95a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba46390f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba4493df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba472be50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0ba488ee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.71s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" ** str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e718b2e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e751a260>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e718afb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e728bb50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e71885b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e82f1330>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e71891e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e7566920>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e7188430>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e7289e10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e7189000>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f17e729b7f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.51s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b4e5ed0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b068460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b60d9f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b4aaf80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b0685b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b2318d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b4aa500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b1fe680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b4aa680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b1fc550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b4baf20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b231360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b068b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b4aadd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b069db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b232680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b309f30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b231210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b2073d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b2317b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b111570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b204e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b260280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9b5b1fdf30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.68s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175509780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f517509c790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175216aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f517562e2c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175140fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175132b30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175351ae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f517532a350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175351810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f51753289d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175133f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175509d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175214130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175351570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f51752143a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f51754cd870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f51754e47f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f51752d8730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f517523e7a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f51753c5f00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f517509ca30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f51754dc6d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5175216fb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f517523d0f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.73s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e522b5390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e5240b130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e5200f190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e51e644c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e5240a6b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e51f0fc70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e5240b040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e52105390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e5240b0d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e52104400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e51f0d8a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e51effeb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e522a62c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e51ffdb10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e52029720>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e5200c880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e521e4df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e521eb640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e520cca90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e522e2f80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e522cece0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e5202b8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e51f0e9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1e5240af50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.86s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11de7ef50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dc0c700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dd807c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11e19e4a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dcb2770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11e0648e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11e03e1a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dca2650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11e03df60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dca3c10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11de974c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11e067310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dd83970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11e19ebc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dd801f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11e03d300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dd90130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11e03f940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dcb2e60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11e03d000>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dd98580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dec6680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dd80910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb11dd91ba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.79s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bb21b40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bde5960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3ba887f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bed9de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3ba88970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3c02efb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3ba88220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bc53460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bc22470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bc525c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3c02ea10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3beee800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bdb91e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bc23b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bdb8ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bc237f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bec99f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3ba8a710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bec9300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bc3b040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bb31a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bb216c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3beeded0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c3bc6c3d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.65s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6f962c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6b287f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6d37b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b70ba3b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6dde800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6bcc610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6b281f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6e85030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b70ba170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6e87fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6db68c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6e517e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6e86e60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6d377f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6e84190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6b28df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6e845b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6ddc100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6f58ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6f77e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6bcfa60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6ca0970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6e86cb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd6b6e50730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.69s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" >> str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf6879570>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf66ac190>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf6b9ae60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf66ad7e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf6b9af20>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf6794c10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf6b9aad0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf6a49330>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf6a3bd60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf6a49030>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf679ba60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7cf66ac2b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.46s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff89c29b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8b17100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff89bba00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8570460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8b16830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff86181f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8b16fb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff88bd3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8b169e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff88bc5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8619c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff860a0e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff89b1120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8701660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8723700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff89baa10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff861bd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8817c10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8721ff0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff89ee1d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8757880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff87175b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff8702830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f1ff89b2b30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.66s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9866530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d99b6aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9865000>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9424700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d99b60e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9760ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d99b7070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d96e8910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d97935e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d96eae30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9865090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9892500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d94b9060>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d99b6a40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d987da50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d97948e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d94ba5f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9796cb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d971e980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9794d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d98677f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9890880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d9790760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6d99b65f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.70s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e954040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429eaaab30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e9578b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e507df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e957ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e86ca30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e954580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e981f90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e957970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e982860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429eaaad10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e76cc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e59c100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e9543a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e59d810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e957310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e59fbe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e982ef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e76ab60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e981a80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e69d5a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e505810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429eaaa170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f429e96d6f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.69s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb199666020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb19987ab60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb199667d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb19973cf40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1996642e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb19973cb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1996645b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb19983b460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1996656c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb19983b9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1995c7460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb199b5a7a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb19983ad70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb199a05600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1998396f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb19965a5f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1995d9de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb1995c57e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb199878f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb199666f80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb19974c190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb19985dab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb199a05d20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb199b5aef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e8275b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e5b4760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e73c070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63eb46dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e73d2d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e64b850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e73c730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e659510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e73c5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e65b2e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e872920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e83d2d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e9f77c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e9e55d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e9f69b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e73fc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e5b5390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e830d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e7199c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63ea0d8d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e872020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e71d1b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e8256f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe63e5b7d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff24723e3e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff246fcc6d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff247154bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff24755efb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff246fccb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff247072830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff246fcc850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2470c0d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff246fcc820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2470c1930>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff247156a10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff247256bf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff247070130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2472b17e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff24715f490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2472b2e90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff24715de10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff24755edd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2470c2f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff2472551b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff247100c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff247157340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff24755f010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ff247103dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.87s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" << str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0371fedde0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0371e20d30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0371d7ff40>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0371e22b90>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0371d7c8e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0371f65780>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0371d7c820>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0371e23a90>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f03721acfa0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0372009ea0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0371ff6e30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f0372009f30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.50s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cae81960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caa142b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cae8fcd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cae464d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cabb14b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cae74b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caaa8340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caba5db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caaaac20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caba48b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cabb23e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caa14040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cac9ab30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caaa9bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cae450f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caaa8b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cae55e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caaa9840>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cafa6680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cabb0dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cac59e10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cabd0df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0caaaa650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa0cae44e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.66s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0ea9810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0a68cd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0ffad10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0a68c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0ffa800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0c50040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0ffa860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0aff100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0ffb0a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0affbb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0d06b90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0ed68f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0bf8ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0a69750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0bfa830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0d30760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0ed5cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0d9af80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0c42bc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0eb0d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0c286d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0bf8130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0e97bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f17e0afeaa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56294ce290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5629060310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5629278be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56294916c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56292dac50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f562927aec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56291eceb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56294a0700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56291ecac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56294a0970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56295f26b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56290602e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5629278d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56292e55a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f562927bc10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56291ef670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56295f22c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56294a2f80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5629210e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5629105660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56294cf220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5629391c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56291ee5f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5629213bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebda1450>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebad7790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebda2020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebc733d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebda21d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebc72380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebda3a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebdc0ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebda0790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdeb9f6170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebdc3d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebdab100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdeb9f4130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebaeb280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdeb9f6920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebd86350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdeb9f6a40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebd872b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebad50c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebaebee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdeba01f90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebbd47f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebaf3d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcdebd86ef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.65s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c8c65c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c448700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c6108b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c9ed9c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c611090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c4e0610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c610460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c6e51b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c611a50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c6e42b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c4f3190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c44bdc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c89ae90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c88a9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c4f3340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c449390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c4e2d70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c5f3d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c9ee320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c612e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c6029b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c6d7970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c713250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f3c5e2740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.62s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962ede290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9630db730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd963296f80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962fd5c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9632972b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962fd5d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9632957e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd96328a5f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd963295420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9632893f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962fd5ea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962e5d3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9633dc220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962eeb1c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd963066f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962ee98d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd963064700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962eebe80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd963066c20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962eebac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962edf310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962fd5d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd9630296f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd962edf010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" | str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072efc5e10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072ebfd2d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072eb581c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072f094550>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072eb583a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072eeb6fb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072eb5be50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072eceb8e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072f0ea1d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072ee837c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072ece05b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f072ebfdf60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.45s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca860d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca9b2b60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca8638e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca420bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca6e8b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca6c8a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca6e9c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca880cd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca7835e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca882110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca423280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca5b1d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca8835e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca6ea500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca881c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca6e87f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca881330>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca6e88e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca853490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca4c55d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca4b7160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca863d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca6ebee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f01ca5cbaf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.65s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a8cff40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a462050>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a9f2800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a718850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a4600a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a8a85b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a460a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a892680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a460430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a8937f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a71a260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a504ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a6fdba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a8cf250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a8a0dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a505cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a8a9030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a5afaf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a527f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a71b1c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a6df9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a58fcd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a719ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb75a506080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.59s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d037fc70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cff10d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d04a2650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d03427a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cff10760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d00b19f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffa4ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffb52a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffa5ea0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffb5420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d01cc700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d00b3190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffb4a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffa7310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffb7160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffa7940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffb5240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d0266da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d0340760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d00d0c70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d01abb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d00d3e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3cffb7670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb3d00b18d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c7c100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0af0fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c7e050>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0a67070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c7ea10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0a659c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c7fa30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c9cfd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0ca9660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c9cc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0a674c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0b372e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c9e9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0caa620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c9c250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0ca8c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c9d0c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0caa2c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c9f3a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0ca9720>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0c5f580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0a5b760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde08d0730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efde0a67220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c14ee5f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c1080370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c1268a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c1612470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c133e800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c1124580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c1080160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c13d4d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c1612e00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c13d7f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c13177f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c1369870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c13d69e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c1269570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c13d7a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c10803d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c13d60b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c133cbe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c12673a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c14c8880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c14c0a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c11263b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c14ece20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f61c1081510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.61s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359cfe050>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359a8c040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359ca7370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f035a01f040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359d568f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359b33e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359a8c550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359bdcfd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f035a01e6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359bdd6f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359d17910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359df17e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359bdf160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359ca7ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359bdcc70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359a8c970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359bdead0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359d56aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359ebd030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359ee5660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359b33eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359c16380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359bdf7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0359df1b10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" & str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c135adab0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c133e1840>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c1333ff70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c133e2a10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c1333c250>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c135495d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c1333cfa0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c133e3c70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c1376df60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c135c6800>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c13694370>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f7c135c59c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.47s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e48b0310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e44611e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e4a06980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e4460820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e4a06aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e4460490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e4a061d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e450ba30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e4a06ad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e4509660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e48b3be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e44fb5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e48d3370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e489e6b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e450b550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e47ddb70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e44fa650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e489d030>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e450a920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e4a06b00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e45f9630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e4736b30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e44f9060>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38e450bd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e102e90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011dc84160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e22ae90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e0c11e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011dc84d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011de482b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011dc85150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011dd2e110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011dc843a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011dd2fb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e22a3b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e0c2380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e0d6b00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e0c9090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011df3a230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e0c1120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e1012d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011ddc7490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011df3add0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011ddc4850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011ddfa110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011df8a2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e103be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f011e0d7280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.63s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcdcfc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcf1eb30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcb17790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbc98c910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcf1e6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbca31270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcf1e1d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcced420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcf1ef80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbccec610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbca31bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbca21510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcdbc760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcc493f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcb03ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcb168f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbccb0b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcb44a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcbdcb80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcbfd2d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcde62c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcb03400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbca30af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7facbcf1eb30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57dcc550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57c13a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57dcf640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57c13d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57dcceb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57c10b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57daeb00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57f22710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57daf7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57ecfeb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57a2f460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57a20ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57c54e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57dae500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c5798e380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57dcee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57bb7820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57bab9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57bb5d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57b1b3d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57bb9870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57c11a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57f223e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f7c57c54400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.65s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f863499dbd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f863472cb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86348b7c70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8634cbf070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f863499dd20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8634cbdab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86349c7670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8634b5cf10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86349c4700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8634b5e080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86347d3a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86348b2fb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8634b5c5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8634b6f4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86348be620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86347c2920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86349f5b40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8634b6dcf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86348be770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8634b6f250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8634a49240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86348d7760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86349f4fa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f86348b7400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.68s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652d61900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6528f4550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652a6cb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652d256f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652ac2cb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652a6ef20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652a7cdc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652d34bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652a7c700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:88: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652d358d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:96: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652e86fb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:105: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652b7f820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652a6f790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652b784c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652a6efe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652a7f010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652d3ff10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652e85a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652aa7790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652bb2410>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb6528f4ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb65299bb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652d60e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb652d25ba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.66s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" ^ str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F................F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff610ca9bd0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff6108e3e80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff61083c460>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff6109d9780>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff61083ce80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff6109da440>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff61083ff70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff610b02800>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff610c6fbe0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff610b01c30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff6108d3460>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff610b97580>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 105 passed in 0.45s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value + target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value + target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.29s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value + target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value * target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value * target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value * target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.32s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value / target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.46s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value / target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.47s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value / target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value / target)
E               ZeroDivisionError: division by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value / target)
E               ZeroDivisionError: division by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value / target)
E               ZeroDivisionError: division by zero

binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 3 failed, 114 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value // target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.47s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value // target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.44s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value // target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value // target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value // target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value // target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 3 failed, 114 passed in 0.38s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value % target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.43s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value % target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FF.................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F...... [ 62%]
.......F......FF....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 106 passed in 0.46s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value % target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F....FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value % target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value % target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value % target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 3 failed, 114 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value ** target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value ** target)
E       ZeroDivisionError: 0.0 cannot be raised to a negative power

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value ** target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value ** target) < distance:
E           ZeroDivisionError: 0.0 cannot be raised to a negative power

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.34s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value ** target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.29s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value >> target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value >> target)
E       ValueError: negative shift count

binarySearchTree1.py:140: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.34s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value >> target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value >> target) < distance:
E           ValueError: negative shift count

binarySearchTree1.py:142: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value >> target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.37s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value << target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value << target)
E       ValueError: negative shift count

binarySearchTree1.py:140: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value << target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value << target) < distance:
E           ValueError: negative shift count

binarySearchTree1.py:142: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
======================== 1 failed, 116 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value << target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.34s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value | target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.32s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value | target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.43s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value | target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.32s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value & target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.32s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value & target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value & target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value ^ target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.33s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value ^ target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.43s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value ^ target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.29s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -102,7 +102,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.left != None:
+        while n.left is None:
             n = n.left
         return n.value
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....F.. [  5%]
.........F....F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
....F..............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F...F.................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f3f7d3e2f80>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:149: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f3f7cf701f0>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 7 failed, 110 passed in 0.42s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -111,7 +111,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.right != None:
+        while n.right is None:
             n = n.right
         return n.value
     

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
......F............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F..FFFFF.FF.FFFFF.FFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
>       assert var_6 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:390: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fc09ce67040>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
>       assert var_7 == 1625
E       assert -2656 == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:464: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fc09ce4a6b0>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 38 failed, 79 passed in 0.76s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val == self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....FF.F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF.....F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 13 failed, 104 passed in 0.44s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target == node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...F.FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......FF...........F..                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 20 failed, 97 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) == distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target == node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 5 failed, 112 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val != self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
======================== 1 failed, 116 passed in 0.33s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target != node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....................F..F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...................FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = var_5.__repr__()
        assert var_6 == 'True'
        var_7 = binary_tree_0.__contains__(var_3)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 5 failed, 112 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) != distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.32s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target != node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...............FF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.................F..F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
======================== 6 failed, 111 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val <= self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 11 failed, 106 passed in 0.43s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target <= node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 22 failed, 95 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) <= distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.36s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target <= node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.32s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val > self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .....F...... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
........F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 3 failed, 114 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target > node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....................F..F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......F............FF.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FF.......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = var_5.__repr__()
        assert var_6 == 'True'
        var_7 = binary_tree_0.__contains__(var_3)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
======================== 7 failed, 110 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) > distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target > node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............FFF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.....F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 10 failed, 107 passed in 0.44s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val >= self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....FF.F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF.....F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 13 failed, 104 passed in 0.44s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target >= node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...F.FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......FF...........FF.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 21 failed, 96 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) >= distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target >= node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............FFF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.....F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 10 failed, 107 passed in 0.43s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val is self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....FF.F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF.....F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 13 failed, 104 passed in 0.43s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target is node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...F.FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......FF...........F..                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 20 failed, 97 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) is distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target is node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 5 failed, 112 passed in 0.36s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val is not self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
======================== 1 failed, 116 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target is not node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....................F..F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...................FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = var_5.__repr__()
        assert var_6 == 'True'
        var_7 = binary_tree_0.__contains__(var_3)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 5 failed, 112 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) is not distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.32s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target is not node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...............FF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.................F..F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
======================== 6 failed, 111 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val == self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert 427 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 6 failed, 111 passed in 0.41s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val != self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......FFFF.FFF..FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: True R:) False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 34 failed, 83 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val < self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......F....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .F..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.........F........                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:(L: F...(L: True R:))' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         ?                       ---      ---------
E         + binary:(L: False R:(L: True R:))

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L... R:) True R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         ?                       ^^^         ----------
E         + binary:(L:(L: False R:) True R:)
E         ?                       ^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:(L: -...L: True R:)))' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         ?                                   ---     ---------
E         + binary:(L: -4493 R:(L: False R:(L: True R:)))

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 17 failed, 100 passed in 0.48s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val > self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......FFFF.FFF..FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 34 failed, 83 passed in 0.59s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val >= self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.53s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val is self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert 427 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 6 failed, 111 passed in 0.44s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val is not self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......FFFF.FFF..FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: True R:) False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 34 failed, 83 passed in 0.64s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val == self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.56s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val == self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F.F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F......F                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF..............F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.remove(bool_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 14 failed, 103 passed in 0.43s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target == node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFF.                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FF...                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.51s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target == node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.........F..............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 2 failed, 115 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val != self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val != self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target != node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target != node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val < self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val < self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....................F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F......... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..................F..F                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.................F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...R:)) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         ?               ^^^^        ^^^^
E         + binary:(L:(L: True R:(L: 3380 R:)) 3380 R:)
E         ?               ^^^        ^^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.remove(bool_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert 1625 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 5 failed, 112 passed in 0.36s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target < node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F.............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:170: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
======================== 1 failed, 116 passed in 0.34s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target < node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.........F..............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 2 failed, 115 passed in 0.36s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val <= self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val <= self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F.F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F......F                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF..............F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.remove(bool_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 14 failed, 103 passed in 0.43s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target <= node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFF.                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FF...                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.46s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target <= node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.........F..............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 2 failed, 115 passed in 0.34s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val >= self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.32s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val >= self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 11 failed, 106 passed in 0.43s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target >= node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 22 failed, 95 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target >= node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val is self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...........FFF.FF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py F......F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
...............FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:82: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 23 failed, 94 passed in 0.53s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val is self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F.F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F......F                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF..............F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.remove(bool_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:25: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 14 failed, 103 passed in 0.43s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target is node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFF.                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FF...                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.47s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target is node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.........F..............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 2 failed, 115 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val is not self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val is not self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.33s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target is not node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.34s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target is not node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.33s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -22,7 +22,7 @@
 
     def addToSubTree(self, parent, val):
         """Add val to parent subtree (if exists) and return root of that subtree."""
-        if parent is None:
+        if parent is not None:
             return BinaryNode(val)
 
         parent.add(val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F.F.... [  5%]
..F......FFFFF.FFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...F...............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF........ [ 62%]
F..F.F...FFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:9: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 442 R:), parent = None, val = 442

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:25: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
        assert var_9 == 'binary:(L: False R:)'
>       var_10 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = 451

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
>       var_6 = binary_tree_0.add(var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:182: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:194: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:212: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:247: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:269: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:287: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:304: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:330: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:346: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 3380 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:385: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -4493 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:10: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:139: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: binary:() R:), parent = None, val = 'binary:()'

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:11: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        object_0 = module_1.object()
        var_3 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:43: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:107: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:133: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:224: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
>       var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:239: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: None R:), parent = None, val = (L: None R:)

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:262: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_5).__module__}.{type(var_5).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:281: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:289: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:317: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:337: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
>       var_3 = binary_node_0.addToSubTree(var_2, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:360: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:388: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:412: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:439: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:457: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -2656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:483: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 1656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.add(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [] R:), parent = None, val = []

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:71: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:209: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -995 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:216: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 47 failed, 70 passed in 0.93s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -37,7 +37,7 @@
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
-            if self.left is None:
+            if self.left is not None:
                 return self.right
 
             child = self.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....F.....F.F........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ...FF..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF.....F....FF.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_11 _________________________________

    def test_case_11():
        bool_0 = False
        list_0 = [bool_0, bool_0]
        binary_node_0 = module_0.BinaryNode(list_0)
>       var_0 = binary_node_0.remove(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [False, False] R:), val = [False, False]

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.add(var_5)
>       var_7 = binary_tree_0.remove(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:198: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L:(L: True R:) True R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:33: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       var_2 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:124: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
        assert var_5 == 427
>       var_6 = binary_tree_0.remove(var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 427 R:), val = 427

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:314: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
>       var_7 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:342: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:391: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:416: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:(L: 1625 R:)), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
>       var_8 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:465: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 1625 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:54: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:70: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 20 failed, 97 passed in 0.61s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -87,7 +87,7 @@
    
     def add(self, value):
         """Insert value into proper location in Binary Tree."""
-        if self.root is None:
+        if self.root is not None:
             self.root = BinaryNode(value)
         else:
             self.root.add(value)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.F.. [  5%]
.FF..FFF.FF.FFFFFFFFFFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..........FF [ 36%]
FF.FF.F.FF.F.F..F..                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .FF.F...... [ 62%]
F.FFFFFF.FFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .FFF [ 84%]
.........FFF..F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:23: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
        assert var_1 == 'binary:()'
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:65: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:73: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:119: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:140: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:190: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:208: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
>       var_3 = binary_tree_0.add(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:225: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:243: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:265: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:285: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:302: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:318: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:326: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:344: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 3380

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:383: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -4493

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:115: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:120: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:125: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:137: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
>       var_0 = binary_tree_0.add(set_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = {binary:()}

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        bool_0 = True
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:192: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:217: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:39: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:100: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:146: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:158: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:183: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:197: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:220: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:244: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:257: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:275: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:293: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:309: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:333: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
>       var_4 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:382: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:408: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:433: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
>       var_1 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:452: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -2656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:481: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 1656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:21: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = []

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:42: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:128: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:170: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 63 failed, 54 passed in 1.17s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -99,7 +99,7 @@
 
     def getMin(self):
         """Returns minimum value."""
-        if self.root is None:
+        if self.root is not None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.left != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....FF. [  5%]
.........F....F..FF.....                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...FFF.............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ......F.... [ 62%]
F...F......F....F.....                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F.F. [ 84%]
.......F......F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fe3fec4bd00>

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:47: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
        assert var_6 == 'binary:(L:(L: False R:) False R:)'
        binary_node_0 = module_0.BinaryNode(var_5)
>       var_7 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:294: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:305: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.__iter__()
        var_4 = var_3.__repr__()
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:142: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: binary:() R:) binary:() R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:149: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fe3fec1d510>

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:156: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:68: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:264: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_node_1.addToSubTree(binary_tree_0, bool_0)
        var_8 = module_0.BinaryNode(binary_tree_0)
>       var_9 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:373: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: True R:) True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
        assert var_1 == 'binary:()'
        with pytest.raises(ValueError):
>           binary_tree_1.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:17: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: [] R:) [] R:) [] R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:107: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.60s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -108,7 +108,7 @@
 
     def getMax(self):
         """Returns maximum value."""
-        if self.root is None:
+        if self.root is not None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.right != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ......F [  5%]
.....FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
......FF...........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .......F... [ 62%]
F..FFFFF.FF.FFFFF.FFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
........FFFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:52: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:213: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:248: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:270: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:331: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:370: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:389: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -4493 R:(L: False R:(L: True R:)))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7efe56ba43a0>

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:169: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = module_0.BinaryTree()
        var_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:298: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:414: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:(L: 1625 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:442: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
>       var_7 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:463: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:(L: 1625 R:)))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7efe56f32710>

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
        assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_0.value is True
        assert var_0.left is None
        assert var_0.right is None
        var_1 = binary_node_0.inorder()
        binary_tree_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_1.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:122: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 42 failed, 75 passed in 0.82s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -133,7 +133,7 @@
         Return value closest to target. If there are several, then
         return one of them.
         """
-        if self.root is None:
+        if self.root is not None:
             return None
         
         best = node = self.root

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
F....FF..F..FFFFF..FFFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...........FF......                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..F.F....F. [ 62%]
F..F...F..FFF.FFFFF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
......F..FFF..F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:56: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.closest(var_2)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:98: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:111: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:187: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:205: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:240: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:262: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:317: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:323: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:362: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:379: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        bool_0 = True
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:195: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        float_0 = 1747.362
        dict_0 = {float_0: float_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(dict_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {1747.362: 1747.362}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:135: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_0)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:204: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:237: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:272: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:306: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:358: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert None == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        bytes_0 = b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'
        set_0 = {bytes_0, bytes_0, bytes_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(set_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 37 failed, 80 passed in 0.81s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -158,7 +158,7 @@
                 yield e
 
     def __repr__(self):
-        if self.root is None:
+        if self.root is not None:
             return "binary:()"
         return "binary:" + str(self.root)
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.FF......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...F...........F...                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..........F [ 62%]
F.....F..........F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:64: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:136: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:213: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:92: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:180: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:15: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
======================== 18 failed, 99 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if not val <= self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F...... [  5%]
..F.......FFFF.FFF..FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F.F...F...F.F.FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:11: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 34 failed, 83 passed in 0.62s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -22,7 +22,7 @@
 
     def addToSubTree(self, parent, val):
         """Add val to parent subtree (if exists) and return root of that subtree."""
-        if parent is None:
+        if not parent is None:
             return BinaryNode(val)
 
         parent.add(val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F.F.... [  5%]
..F......FFFFF.FFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py FF..F..F.F.. [ 36%]
...F...............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF........ [ 62%]
F..F.F...FFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.FF........F...FF.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:9: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 442 R:), parent = None, val = 442

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:25: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
        assert var_9 == 'binary:(L: False R:)'
>       var_10 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = 451

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
>       var_6 = binary_tree_0.add(var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:182: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:194: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:212: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:247: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:269: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:287: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:304: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:330: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:346: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 3380 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:385: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -4493 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:10: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:17: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:39: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:70: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:103: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:139: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: binary:() R:), parent = None, val = 'binary:()'

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:11: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        object_0 = module_1.object()
        var_3 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:43: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:107: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:133: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:224: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
>       var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:239: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: None R:), parent = None, val = (L: None R:)

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:262: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_5).__module__}.{type(var_5).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:281: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:289: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:317: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:337: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
>       var_3 = binary_node_0.addToSubTree(var_2, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:360: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:388: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:412: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:439: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:457: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -2656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:483: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 1656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.add(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [] R:), parent = None, val = []

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:71: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:209: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -995 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:216: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 47 failed, 70 passed in 0.90s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if not val < self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..........F..........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....FF.F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF..........F.......                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF.....F.........                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
        var_0 = binary_node_0.remove(str_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:54: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 13 failed, 104 passed in 0.44s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -37,7 +37,7 @@
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
-            if self.left is None:
+            if not self.left is None:
                 return self.right
 
             child = self.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
....F.....F.F........F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ...FF..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
F.FF.....F....FF.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_11 _________________________________

    def test_case_11():
        bool_0 = False
        list_0 = [bool_0, bool_0]
        binary_node_0 = module_0.BinaryNode(list_0)
>       var_0 = binary_node_0.remove(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [False, False] R:), val = [False, False]

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.add(var_5)
>       var_7 = binary_tree_0.remove(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:198: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L:(L: True R:) True R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:33: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       var_2 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:124: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
        assert var_5 == 427
>       var_6 = binary_tree_0.remove(var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 427 R:), val = 427

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:314: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
>       var_7 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:342: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:391: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:416: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:(L: 1625 R:)), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
>       var_8 = binary_tree_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:465: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 1625 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:54: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:70: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 20 failed, 97 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -41,7 +41,7 @@
                 return self.right
 
             child = self.left
-            while child.right:
+            while not child.right:
                 child = child.right
             
             childKey = child.value;

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.... [  5%]
..F.......F.....FFF..F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ....F..F.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.......... [ 62%]
...F................F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.FF...............                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.remove(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:26: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) False R:)'
>       var_5 = binary_tree_0.remove(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:78: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
>       var_7 = binary_tree_0.remove(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:172: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.remove(var_6)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:276: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
        assert var_6 == 'binary:(L:(L: False R:) False R:)'
        binary_node_0 = module_0.BinaryNode(var_5)
        var_7 = binary_tree_0.getMin()
        assert var_7 is False
>       var_8 = binary_tree_0.remove(var_4)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_2.__repr__()
        binary_node_0 = module_0.BinaryNode(var_5)
        var_6 = binary_tree_0.add(var_0)
        var_7 = binary_tree_0.getMin()
>       var_8 = binary_tree_0.remove(var_7)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:313: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L:(L: False R:) False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:)) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: True R:(L: 3380 R:)) False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = var_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:41: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:72: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.remove(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:13: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
>       var_3 = binary_node_0.remove(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
>       var_11 = var_9.remove(var_7)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:469: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) 1625 R:), val = 1625

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
>       var_4 = binary_node_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:60: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:73: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 14 failed, 103 passed in 0.52s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -53,7 +53,7 @@
     def removeFromParent(self, parent, val):
         """Helper method for remove. Ensures proper behavior when removing node that 
         has children."""
-        if parent:
+        if not parent:
             return parent.remove(val)
         return None
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......F..............F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..F.FFFF.... [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...F......F.......F.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
........F........F                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
        var_4 = binary_tree_0.closest(var_2)
        assert var_4 is False
        var_5 = var_2.__repr__()
>       var_6 = binary_tree_0.remove(var_3)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:113: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: 3380 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.remove(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:24: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:42: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'X>'
        str_1 = 'qkr(Szzyf\t'
        binary_node_0 = module_0.BinaryNode(str_1)
>       var_0 = binary_node_0.remove(str_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:53: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:36: in remove
    self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: qkr(Szzyf	 R:), parent = None, val = 'X>'

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(bool_0, bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:64: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = False, val = False

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'bool' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:73: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
        var_8 = var_3.__repr__()
        assert var_8 == '(L: False R:(L: True R:))'
>       object_0 = binary_node_0.removeFromParent(var_5, var_5)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: True R:)), parent = None, val = None

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.remove(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:248: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:36: in remove
    self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = False

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert 1625 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert 1656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_node_0.remove(bool_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:114: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:36: in remove
    self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = False

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
>       var_0 = binary_node_0.remove(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:225: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 112.342 R:), parent = None, val = 2683

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 14 failed, 103 passed in 0.51s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -61,7 +61,7 @@
         """Useful debugging function to produce linear tree representation."""
         leftS = ''
         rightS = ''
-        if self.left:
+        if not self.left:
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E         - (L: None R:)
E         ?    -
E         + (L:None None R:)
E         ?         +++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:16: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E         - (L: None R:)
E         ?    -
E         + (L:None None R:)
E         ?         +++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:32: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:(L:No...(L: True R:))' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         ?                       ---      ---------
E         + binary:(L:None False R:(L: True R:))
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: 3380 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:(L:No...L: True R:)))' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         ?                                   ---     ---------
E         + binary:(L:None -4493 R:(L:None False R:(L: True R:)))
E         ?           ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_0.__repr__()
>       assert var_3 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L:None False R:(L:None True R:))
E         ?    ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:89: AssertionError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L:None False R:)' == '(L: False R:)'
E         - (L: False R:)
E         + (L:None False R:)
E         ?    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:97: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       assert var_1 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L: True R:)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L: True R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:106: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E         - (L: None R:)
E         ?    -
E         + (L:None None R:)
E         ?         +++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:50: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:(L:None True R:)' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:(L:None True R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
        var_8 = var_3.__repr__()
>       assert var_8 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L:None False R:(L:None True R:))
E         ?    ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:152: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
>       assert var_4 == '(L:(L: False R:) False R:)'
E       AssertionError: assert '(L: False R:)' == '(L:(L: False R:) False R:)'
E         - (L:(L: False R:) False R:)
E         + (L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:297: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:No...ne False R:))' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:None -2656 R:(L:None False R:))
E         ?           ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
>       assert var_2 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L: True R:)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L: True R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L:None False R:)' == '(L: False R:)'
E         - (L: False R:)
E         + (L:None False R:)
E         ?    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:94: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_node_0.__repr__()
>       assert var_6 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L: True R:)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L: True R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:182: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.__repr__()
>       assert var_1 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L:None False R:(L:None True R:))
E         ?    ++++            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:219: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.59s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -63,7 +63,7 @@
         rightS = ''
         if self.left:
             leftS = str(self.left)
-        if self.right:
+        if not self.right:
             rightS = str(self.right)
         return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F... [  5%]
..F......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py .......FFF.. [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F....... [ 62%]
F..F.........F...F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.F...F.....F....F.                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E         - (L: None R:)
E         + (L: None R:None)
E         ?            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:16: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E         - (L: None R:)
E         + (L: None R:None)
E         ?            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:32: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L:(L...False R:None)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:(L:(L: False R:None) False R:None)
E         ?                       ++++          ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         + binary:(L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L:(L...False R:None)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:(L:(L: False R:None) False R:None)
E         ?                       ++++          ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L... 3380 R:None)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         ?                     -----------   -
E         + binary:(L:(L: False R:) 3380 R:None)
E         ?                                ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:(L: -4493 R:)' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         + binary:(L: -4493 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        assert binary_node_0.left is None
        assert var_0.left is None
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_1.value is False
        assert var_1.left is None
        assert var_1.right is None
        bool_1 = True
        binary_tree_0 = module_0.BinaryTree()
        var_2 = var_0.addToSubTree(var_0, bool_1)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.right).__module__}.{type(var_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_1.right).__module__}.{type(var_1.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.value is False
        assert var_2.left is None
        assert f'{type(var_2.right).__module__}.{type(var_2.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_0.__repr__()
>       assert var_3 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:89: AssertionError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L: False R:None)' == '(L: False R:)'
E         - (L: False R:)
E         + (L: False R:None)
E         ?             ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:97: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       assert var_1 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L:(L: True ... True R:None)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L:(L: True R:None) True R:None)
E         ?               ++++         ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:106: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E         - (L: None R:)
E         + (L: None R:None)
E         ?            ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:50: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:(L: True R:None)' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:(L: True R:None)
E         ?                   ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
        var_8 = var_3.__repr__()
>       assert var_8 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:152: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
>       assert var_4 == '(L:(L: False R:) False R:)'
E       AssertionError: assert '(L:(L: False...False R:None)' == '(L:(L: False R:) False R:)'
E         - (L:(L: False R:) False R:)
E         + (L:(L: False R:None) False R:None)
E         ?                ++++          ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:297: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L:(L... 1656 R:None)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L:(L: False R:None) 1656 R:None)
E         ?                       ++++         ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
>       assert var_2 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L:(L: True ... True R:None)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L:(L: True R:None) True R:None)
E         ?               ++++         ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L: False R:None)' == '(L: False R:)'
E         - (L: False R:)
E         + (L: False R:None)
E         ?             ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:94: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_node_0.__repr__()
>       assert var_6 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L:(L: True ... True R:None)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L:(L: True R:None) True R:None)
E         ?               ++++         ++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:182: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.__repr__()
>       assert var_1 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L: False R:)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:219: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 24 failed, 93 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -69,7 +69,7 @@
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""
-        if self.left:
+        if not self.left:
             for v in self.left.inorder():
                 yield v
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -75,7 +75,7 @@
 
         yield self.value
 
-        if self.right:
+        if not self.right:
             for v in self.right.inorder():
                 yield v
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -87,7 +87,7 @@
    
     def add(self, value):
         """Insert value into proper location in Binary Tree."""
-        if self.root is None:
+        if not self.root is None:
             self.root = BinaryNode(value)
         else:
             self.root.add(value)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.F.. [  5%]
.FF..FFF.FF.FFFFFFFFFFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ..........FF [ 36%]
FF.FF.F.FF.F.F..F..                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .FF.F...... [ 62%]
F.FFFFFF.FFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .FFF [ 84%]
.........FFF..F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:23: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
        assert var_1 == 'binary:()'
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:65: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:73: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:119: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:140: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:190: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:208: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
>       var_3 = binary_tree_0.add(var_2)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:225: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:243: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:265: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:285: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:302: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:318: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:326: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:344: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 3380

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:383: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -4493

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:115: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:120: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:125: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:137: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
>       var_0 = binary_tree_0.add(set_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = {binary:()}

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        bool_0 = True
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:192: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:217: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:39: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:100: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:146: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:158: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:183: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:197: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:220: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:244: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:257: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:275: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:293: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:309: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:333: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
>       var_4 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:382: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:408: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:433: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
>       var_1 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:452: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -2656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:481: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 1656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:21: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(list_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = []

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:42: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:128: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:170: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 63 failed, 54 passed in 1.11s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -94,7 +94,7 @@
 
     def remove(self, val):
         """Remove value from tree."""
-        if self.root:
+        if not self.root:
             self.root = self.root.remove(val)
 
     def getMin(self):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F..F. [  5%]
..F......FF...F..F...F..                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
..F................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .....F..... [ 62%]
F.F...........F.F.....                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:20: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:45: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:70: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:137: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:223: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:282: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:130: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'j_XwI\'J"{^zfX[y'
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(str_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:63: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = 'j_XwI\'J"{^zfX[y'

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_tree_0.remove(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:357: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = False

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
>       var_0 = binary_tree_0.remove(float_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:41: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = -1660.53234

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
======================== 15 failed, 102 passed in 0.50s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -99,7 +99,7 @@
 
     def getMin(self):
         """Returns minimum value."""
-        if self.root is None:
+        if not self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.left != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....FF. [  5%]
.........F....F..FF.....                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...FFF.............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ......F.... [ 62%]
F...F......F....F.....                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F.F. [ 84%]
.......F......F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f65e32301c0>

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:47: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
        assert var_6 == 'binary:(L:(L: False R:) False R:)'
        binary_node_0 = module_0.BinaryNode(var_5)
>       var_7 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:294: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:305: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.__iter__()
        var_4 = var_3.__repr__()
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:142: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: binary:() R:) binary:() R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:149: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f65e30a9150>

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:156: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:68: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:264: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_node_1.addToSubTree(binary_tree_0, bool_0)
        var_8 = module_0.BinaryNode(binary_tree_0)
>       var_9 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:373: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: True R:) True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
        assert var_1 == 'binary:()'
        with pytest.raises(ValueError):
>           binary_tree_1.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:17: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: [] R:) [] R:) [] R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:107: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_5
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 18 failed, 99 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -102,7 +102,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.left != None:
+        while not n.left != None:
             n = n.left
         return n.value
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....F.. [  5%]
.........F....F.........                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
....F..............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F...F.................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fb60a32b8b0>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:149: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fb60a4e94e0>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 7 failed, 110 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -108,7 +108,7 @@
 
     def getMax(self):
         """Returns maximum value."""
-        if self.root is None:
+        if not self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.right != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ......F [  5%]
.....FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
......FF...........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .......F... [ 62%]
F..FFFFF.FF.FFFFF.FFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
........FFFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:52: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:213: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:248: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:270: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:331: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:370: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:389: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -4493 R:(L: False R:(L: True R:)))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fb4f8612680>

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:169: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = module_0.BinaryTree()
        var_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:298: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:414: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:(L: 1625 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:442: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
>       var_7 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:463: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:(L: 1625 R:)))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fb4f88cc310>

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
        assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_0.value is True
        assert var_0.left is None
        assert var_0.right is None
        var_1 = binary_node_0.inorder()
        binary_tree_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_1.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:122: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_6
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 42 failed, 75 passed in 0.85s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -111,7 +111,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.right != None:
+        while not n.right != None:
             n = n.right
         return n.value
     

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.....FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
......F............                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
F..FFFFF.FF.FFFFF.FFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
>       assert var_6 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:390: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fadb3dd2a70>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
>       assert var_7 == 1625
E       assert -2656 == 1625

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:464: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fadb3bd4b20>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 38 failed, 79 passed in 0.83s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -118,7 +118,7 @@
     def __contains__(self, target):
         """Check whether BST contains target value."""
         node = self.root
-        while node:
+        while not node:
             if target < node.value :
                 node = node.left
             elif target > node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.... [  5%]
F.F..FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F.F........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF.....F.. [ 62%]
...F.F.FFFFFFFFFFFFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:21: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:71: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:91: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:117: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:188: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:206: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:221: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:241: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:263: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:283: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:300: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:324: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:341: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:363: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:380: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:186: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:8: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:24: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:34: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:79: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:130: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:168: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:209: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:216: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:234: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:252: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:270: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:286: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:304: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:326: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:354: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:429: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:449: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:476: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:193: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 44 failed, 73 passed in 0.82s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if not target < node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...F.FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......FF...........FF.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 21 failed, 96 passed in 0.48s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -133,7 +133,7 @@
         Return value closest to target. If there are several, then
         return one of them.
         """
-        if self.root is None:
+        if not self.root is None:
             return None
         
         best = node = self.root

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
F....FF..F..FFFFF..FFFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...........FF......                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..F.F....F. [ 62%]
F..F...F..FFF.FFFFF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
......F..FFF..F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:56: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.closest(var_2)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:98: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:111: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:187: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:205: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:240: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:262: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:317: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:323: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:362: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:379: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        bool_0 = True
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:195: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        float_0 = 1747.362
        dict_0 = {float_0: float_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(dict_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {1747.362: 1747.362}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:135: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_0)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:204: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:237: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:272: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:306: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:358: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert None == 427

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        bytes_0 = b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'
        set_0 = {bytes_0, bytes_0, bytes_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(set_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 37 failed, 80 passed in 0.69s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -138,7 +138,7 @@
         
         best = node = self.root
         distance = abs(self.root.value - target)
-        while node:
+        while not node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
...............FF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
...............F.FF.FF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert 427 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert 427 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert 1625 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert 1656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 9 failed, 108 passed in 0.44s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if not abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if not target < node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
..............FFF.....FF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
..............F.....F.                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FFF......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 10 failed, 107 passed in 0.42s ========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -153,7 +153,7 @@
 
     def __iter__(self):
         """In order traversal of elements in the tree."""
-        if self.root:
+        if not self.root:
             for e in self.root.inorder():
                 yield e
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........F...............                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
..............F....                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
........F.............                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FF.......                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       object_0 = module_1.object(*var_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:132: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       object_0 = module_1.object(*binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:208: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       object_0 = module_1.object(*binary_tree_0)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:211: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
        assert var_3 is True
        binary_tree_1 = module_0.BinaryTree()
>       object_0 = module_1.object(*binary_tree_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:141: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
        assert var_3 is True
        binary_tree_1 = module_0.BinaryTree()
>       object_0 = module_1.object(*binary_tree_1)

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
======================== 5 failed, 112 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -158,7 +158,7 @@
                 yield e
 
     def __repr__(self):
-        if self.root is None:
+        if not self.root is None:
             return "binary:()"
         return "binary:" + str(self.root)
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
.FF......FF....F.F...F.F                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...F...........F...                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..........F [ 62%]
F.....F..........F.FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F... [ 84%]
..................                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:64: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        binary_tree_1 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:136: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:213: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:92: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:180: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:()

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:15: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_15
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_10
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
======================== 18 failed, 99 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -124,7 +124,7 @@
             elif target > node.value:
                 node = node.right
             else:
-                return True
+                return False
                 
         return False
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
......FF.FF.FFFFF...FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
........F..........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
.......F.........FFFFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F. [ 84%]
..............F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        set_0 = {binary_tree_0}
        var_0 = binary_tree_0.add(set_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.__contains__(set_0)
>       assert var_1 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:177: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 22 failed, 95 passed in 0.57s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -126,7 +126,7 @@
             else:
                 return True
                 
-        return False
+        return True
 
     def closest(self, target):
         """

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.... [  5%]
F.F..FFF.FF.FFFFFFF.FFFF                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
..........F........                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF.....F.. [ 62%]
...F.FF.FFFFFFFFF..FFF                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
.........FF...F...                                                       [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:22: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:72: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:92: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:103: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:118: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:139: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:161: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:189: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:207: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:222: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:242: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:264: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:284: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:301: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:325: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:342: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:364: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:381: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py:187: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:9: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:25: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:35: AssertionError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:80: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:131: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:169: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:217: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:235: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:253: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:287: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:305: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:327: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:355: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:430: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:450: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:477: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:194: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_8
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_19
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 42 failed, 75 passed in 0.74s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -70,7 +70,7 @@
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""
         if self.left:
-            for v in self.left.inorder():
+            for v in []:
                 yield v
 
         yield self.value

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -76,7 +76,7 @@
         yield self.value
 
         if self.right:
-            for v in self.right.inorder():
+            for v in []:
                 yield v
 
 class BinaryTree:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.31s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -154,7 +154,7 @@
     def __iter__(self):
         """In order traversal of elements in the tree."""
         if self.root:
-            for e in self.root.inorder():
+            for e in []:
                 yield e
 
     def __repr__(self):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 117 items

DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....... [  5%]
........................                                                 [ 26%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MIO.py ............ [ 36%]
...................                                                      [ 52%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ........... [ 62%]
......................                                                   [ 81%]
DYNAMOSA-MIO-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .... [ 84%]
..................                                                       [100%]

============================= 117 passed in 0.34s ==============================